Random walks on finite groups and rapidly mixing Markov chains
نویسنده
چکیده
© Springer-Verlag, Berlin Heidelberg New York, 1983, tous droits réservés. L’accès aux archives du séminaire de probabilités (Strasbourg) (http://www-irma. u-strasbg.fr/irma/semproba/index.shtml), implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright.
منابع مشابه
Random walks on directed Cayley graphs
Previous authors have shown bounds on mixing time of random walks on finite undirected Cayley graphs, both with and without self-loops. We extend this to the most general case by showing that a similar bound holds for walks on all finite directed Cayley graphs. These are shown by use of two new canonical path theorems for mixing time of non-reversible Markov chains. The first result is related ...
متن کاملRandom Walks on Finite Quantum Groups
1 Markov chains and random walks in classical probability . . 3 2 Quantum Markov chains . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3 Random walks on comodule algebras . . . . . . . . . . . . . . . . . . . . . . 7 4 Random walks on finite quantum groups . . . . . . . . . . . . . . . . . . 11 5 Spatial Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملRandom Walks on Finite Groups
Markov chains on finite sets are used in a great variety of situations to approximate, understand and sample from their limit distribution. A familiar example is provided by card shuffling methods. From this viewpoint, one is interested in the “mixing time” of the chain, that is, the time at which the chain gives a good approximation of the limit distribution. A remarkable phenomenon known as t...
متن کاملTwo conductance theorems, two canonical path theorems, and two walks on directed Cayley graphs
We show two Conductance-like theorems for mixing time of non-reversible non-lazy walks. These bounds involve a measure of expansion which expresses how well ergodic flow is distributed among vertices, which while conceptually similar to Blocking Conductance apply to non-lazy non-reversible Markov chains as well. As an application we derive two canonical path theorems for mixing time of non-reve...
متن کاملRandomized Search of Graphs in Log Space and Probabilistic Computation
Reingold has shown that L = SL, that s-t connectivity in a poly-mixing digraph is complete for promise-RL, and that s-t connectivity for a poly-mixing out-regular digraph with known stationary distribution is in L. Several properties that bound the mixing times of random walks on digraphs have been identified, including the digraph conductance and the digraph spectral expansion. However, rapidl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005